Multilevel Filtering for High Dimensional Nearest Neighbor Search
نویسندگان
چکیده
منابع مشابه
Random Projection with Filtering for Nearly Duplicate Search
High dimensional nearest neighbor search is a fundamental problem and has found applications in many domains. Although many hashing based approaches have been proposed for approximate nearest neighbor search in high dimensional space, one main drawback is that they often return many false positives that need to be filtered out by a post procedure. We propose a novel method to address this limit...
متن کاملUtilization of Principle Axis Analysis for Fast Nearest Neighbor Searches in High-Dimensional Image Databases
This paper presents an efficient indexing method for similarity searches in highdimensional image database by principal axis analysis. Image databases often represent the image objects as high-dimensional feature vectors and access them via the feature vectors and similarity measure. However, the performance of the existing nearest neighbor search methods is far from satisfactory for feature ve...
متن کاملVector Approximation based Indexing for High-Dimensional Multimedia Databases
the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexing method for high-dimensional multimedia databases using the filtering approach, known also as vector approximation approach which supports the nearest neighbor search efficiently. Our technique called RA +-Blocks (Region...
متن کاملA Parallel Algorithms on Nearest Neighbor Search
The (k-)nearest neighbor searching has very high computational costs. The algorithms presented for nearest neighbor search in high dimensional spaces have have suffered from curse of dimensionality, which affects either runtime or storage requirements of the algorithms terribly. Parallelization of nearest neighbor search is a suitable solution for decreasing the workload caused by nearest neigh...
متن کاملFast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor se...
متن کامل